ARGOS - Modelling the Economic, Environmental, and Social Implications for New Zealand from Different Scenarios Relating to the Demand and Supply of Organic Products

This paper reports on some of the initial findings of the ARGOS (Agricultural Research Group on (Sustainability) programme, a 6 year quasi-experimental research project with the aim to model the economic, environmental, and social differences between organic, environmentally friendly and conventional systems of production. In the first section the paper reviews the development of organic markets, details the production costs and reports some preliminary results from ARGOS. The information is then used to develop potential future scenarios relating to the organic sector, which are assessed using the Lincoln Trade and Environment Model (LTEM), a partial equilibrium trade model that differentiates between organic and conventional production methods. This paper concentrates upon the difference between organic and conventional production, consumption and trade.sustainability, New Zealand, organic markets, ARGOS, Demand and Price Analysis, F18, Q17,

Cellular spanning trees and Laplacians of cubical complexes

We prove a Matrix-Tree Theorem enumerating the spanning trees of a cell complex in terms of the eigenvalues of its cellular Laplacian operators, generalizing a previous result for simplicial complexes. As an application, we obtain explicit formulas for spanning tree enumerators and Laplacian eigenvalues of cubes; the latter are integers. We prove a weighted version of the eigenvalue formula, providing evidence for a conjecture on weighted enumeration of cubical spanning trees. We introduce a cubical analogue of shiftedness, and obtain a recursive formula for the Laplacian eigenvalues of shifted cubical complexes, in particular, these eigenvalues are also integers. Finally, we recover Adin's enumeration of spanning trees of a complete colorful simplicial complex from the cellular Matrix-Tree Theorem together with a result of Kook, Reiner and Stanton.Comment: 24 pages, revised version, to appear in Advances in Applied Mathematic

Simplicial matrix-tree theorems

We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $\Delta$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree Theorem that counts simplicial spanning trees, weighted by the squares of the orders of their top-dimensional integral homology groups, in terms of the Laplacian matrix of $\Delta$. As in the graphic case, one can obtain a more finely weighted generating function for simplicial spanning trees by assigning an indeterminate to each vertex of $\Delta$ and replacing the entries of the Laplacian with Laurent monomials. When $\Delta$ is a shifted complex, we give a combinatorial interpretation of the eigenvalues of its weighted Laplacian and prove that they determine its set of faces uniquely, generalizing known results about threshold graphs and unweighted Laplacian eigenvalues of shifted complexes.Comment: 36 pages, 2 figures. Final version, to appear in Trans. Amer. Math. So

Simplicial and Cellular Trees

Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed first by Bolker, Kalai and Adin, and more recently by numerous authors, the fundamental topological properties of a tree --- namely acyclicity and connectedness --- can be generalized to arbitrary dimension as the vanishing of certain cellular homology groups. This point of view is consistent with the matroid-theoretic approach to graphs, and yields higher-dimensional analogues of classical enumerative results including Cayley's formula and the matrix-tree theorem. A subtlety of the higher-dimensional case is that enumeration must account for the possibility of torsion homology in trees, which is always trivial for graphs. Cellular trees are the starting point for further high-dimensional extensions of concepts from algebraic graph theory including the critical group, cut and flow spaces, and discrete dynamical systems such as the abelian sandpile model.Comment: 39 pages (including 5-page bibliography); 5 figures. Chapter for forthcoming IMA volume "Recent Trends in Combinatorics

A non-partitionable Cohen-Macaulay simplicial complex

A long-standing conjecture of Stanley states that every Cohen-Macaulay simplicial complex is partitionable. We disprove the conjecture by constructing an explicit counterexample. Due to a result of Herzog, Jahan and Yassemi, our construction also disproves the conjecture that the Stanley depth of a monomial ideal is always at least its depth.Comment: Final version. 13 pages, 2 figure

The Partitionability Conjecture

This is the authors' accepted manuscript. First published in Notices of the American Mathematical Society Volume 64 Issue 2, 2017, published by the American Mathematical Society.In 1979 Richard Stanley made the following conjecture: Every Cohen-Macaulay simplicial complex is partitionable. Motivated by questions in the theory of face numbers of simplicial complexes, the Partitionability Conjecture sought to connect a purely combinatorial condition (partitionability) with an algebraic condition (Cohen-Macaulayness). The algebraic combinatorics community widely believed the conjecture to be true, especially in light of related stronger conjectures and weaker partial results. Nevertheless, in a 2016 paper [DGKM16], the three of us (Art, Carly, and Jeremy), together with Jeremy's graduate student Bennet Goeckner, constructed an explicit counterexample. Here we tell the story of the significance and motivation behind the Partitionability Conjecture and its resolution. The key mathematical ingredients include relative simplicial complexes, nonshellable balls, and a surprise appearance by the pigeonhole principle. More broadly, the narrative theme of modern algebraic combinatorics: to understand discrete structures through algebraic, geometric, and topological lenses

A method for exploratory repeated-measures analysis applied to a breast-cancer screening study

When a model may be fitted separately to each individual statistical unit, inspection of the point estimates may help the statistician to understand between-individual variability and to identify possible relationships. However, some information will be lost in such an approach because estimation uncertainty is disregarded. We present a comparative method for exploratory repeated-measures analysis to complement the point estimates that was motivated by and is demonstrated by analysis of data from the CADET II breast-cancer screening study. The approach helped to flag up some unusual reader behavior, to assess differences in performance, and to identify potential random-effects models for further analysis.Comment: Published in at http://dx.doi.org/10.1214/11-AOAS481 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org

The Future of Intergenerational Relations in Aging Societies

As the pressure mounts to reduce the public costs of supporting rapidly aging societies, responsibility for supporting elderly people will increasingly fall on their family members. This essay explores the family’s capacity to respond to these growing challenges. In particular, we examine how family change and growing inequality pose special problems in developed nations, especially the United States. This essay mentions a series of studies supported by the MacArthur Foundation Research Network on an Aging Society that aim to examine the future of intergenerational exchange. We focus particularly on adults who have dependent and young-adult children and who must also care for elderly parents, a fraction of the population that will grow substantially in the coming twenty-five years